Solving some affine equations over finite fields
نویسندگان
چکیده
منابع مشابه
Solving sparse linear equations over finite fields
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algor...
متن کاملSolving systems of diagonal polynomial equations over finite fields
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the pol...
متن کاملDiscrete Quantum Walk for Solving Nonlinear Equations over Finite Fields
This paper reviews some of quantum computation basics: qubit definition, quantum operations, quantum algorithms, measurement and quantum walk, and then applies the discrete quantum hypercube walk to the nonlinear systems over Galois Finite Field GF (2). The modified quantum walk algorithm needs O( mn 2 ) iteration, while the best classical general solution takes O( nm 2 ) iteration. The paper a...
متن کاملOn solving sparse algebraic equations over finite fields
A system of algebraic equations over the finite field Fq is called sparse if each equation depends on a small number of variables. In this paper new algorithms for solving such equations are presented. The mathematical expectation of their running time is derived. It compares favorably with the worst case estimations coming from the l-SAT problem analysis for q = 2 and the trivial estimation wi...
متن کاملOn solving sparse algebraic equations over finite fields II
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In this paper deterministic AgreeingGluing algorithm introduced earlier in [9] for solving such equations is studied. Its expected running time on uniformly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2020
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2020.101746